The Extension Degree Conditions for Fractional Factor
نویسندگان
چکیده
منابع مشابه
Degree Conditions of Fractional ID-k-Factor-Critical Graphs
We say that a simple graph G is fractional independent-set-deletable k-factor-critical, shortly, fractional ID-k-factor-critical, if G− I has a fractional k-factor for every independent set I of G. Some sufficient conditions for a graph to be fractional ID-k-factor-critical are studied in this paper. Furthermore, we show that the result is best possible in some sense. 2010 Mathematics Subject C...
متن کاملBoundary conditions for fractional diffusion
This paper derives physically meaningful boundary conditions for fractional diffusion equations, using a mass balance approach. Numerical solutions are presented, and theoretical properties are reviewed, including well-posedness and steady state solutions. Absorbing and reflecting boundary conditions are considered, and illustrated through several examples. Reflecting boundary conditions involv...
متن کاملfactor influencing the adoption of internet banking
دوره مشترک کارشناسی ارشد بازاریابی و تجارت الکترونیک دانشگاه تربیت مدرس_ دانشگاه تکنولوژی lule? چکیده پایان نامه عوامل موثر بر پذیرش اینترنت بانک توسط مشتریان پیشرفت فناوری اطلاعات و ارتباطات و به طور خاص رشد اینترنت جهت تراکنش های معاملات بازرگانی، تاثیر بسیار عمیقی در صنعت بانکداری داشته است.این در حالی ست که نفوذ بانکداری اینترنتی در کشورهای در حال توسعه بسیار کندتر از نفوذ آن ...
15 صفحه اولDegree conditions for group connectivity
Let G be a 2-edge-connected simple graph on n ≥ 13 vertices and A an (additive) abelian group with |A| ≥ 4. In this paper, we prove that if for every uv 6∈ E(G), max{d(u), d(v)} ≥ n/4, then eitherG is A-connected orG can be reduced to one of K2,3, C4 and C5 by repeatedly contracting proper A-connected subgraphs, where Ck is a cycle of length k. We also show that the bound n ≥ 13 is the best pos...
متن کاملMinimum degree conditions for cycles
In this note we discuss the lengths of cycles which are forced to exist in an n-vertex graph with minimum degree δ. We show that for any integer k ≥ 2 there exists n0 such that if n ≥ n0 and G is an n-vertex graph with δ(G) = δ ≥ n/k then the following are true. (i) G contains Ct for every even 4 ≤ t ≤ ⌈ n k−1 ⌉ , (ii) either G is in a known exceptional class or G contains Ct for every odd t ∈ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Sinica, English Series
سال: 2020
ISSN: 1439-8516,1439-7617
DOI: 10.1007/s10114-020-9156-0